Buffer Minimization In RTL Synthesis From Coarse-grained Dataflow Specification

نویسندگان

  • Hoeseok Yang
  • Hyunuk Jung
چکیده

This paper concerns area-efficient automatic hardware architecture synthesis and its optimization from dataflow graph(DFG) specification for fast HW/SW cosynthesis. A node in a DFG represents a coarse grain computation block such as FIR and DCT and a port in a block may consume multiple data samples per invocation, which distinguishes our approach from conventional behavioral synthesis and complicates the problem. In the proposed design methodology, arcs in DFG are synthesized to intermediate buffers to store the transient data samples between nodes by using either registers or memory. Since the buffer size is the major factor of hardware overhead in the synthesized architecture, we aim to reduce the buffer size by applying a shift buffering technique and a buffer sharing technique. Experiments with H.263 decoder subsystem demonstrate the proposed techniques reduce the buffer requirement by around 44% to make the resultant hardware close to the hand-optimized hardware.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimized RTL Code Generation from Coarse-Grain Dataflow Specification for Fast HW/SW Cosynthesis

This paper presents a new methodology of automatic RTL code generation from coarse-grain dataflow specification for fast HW/SW cosynthesis. A node in a coarse-grain dataflow specification represents a functional block such as FIR and DCT and an arc may deliver multiple data samples per block invocation, which complicates the problem and distinguishes it from behavioral synthesis problem. Given ...

متن کامل

Transformation and VHDL Code Generation from Coarse-grained Dataflow Graph

This paper discusses how we generate VHDL codes for DSP applications described in data ow graphs. Because the generated VHDL code implements the details of the control structure we can easily transform it into a running circuit without any modi cation, using logic synthesis tools. To improve the quality of the synthesized circuit we apply some graph transformation techniques to an original data...

متن کامل

Systematic Consolidation of Input and Output Buffers in Synchronous Dataflow Specifications1

Synchronous Dataflow, a subset of dataflow, is a commonly used model of computation in block diagram DSP programming environments. Because of the limited amount of memory in embedded DSPs, a key problem during software synthesis from SDF specifications is the minimization of the memory used by the target code. We develop a powerful formal technique called buffer merging that attempts to overlay...

متن کامل

Memory-Optimized Software Synthesis from Dataflow Program Graphs with Large Size Data Samples

In multimedia and graphics applications, data samples of nonprimitive type require significant amount of buffer memory. This paper addresses the problem of minimizing the buffer memory requirement for such applications in embedded software synthesis from graphical dataflow programs based on the synchronous dataflow (SDF) model with the given execution order of nodes. We propose a memory minimiz...

متن کامل

Systematic Synthesis of Multimode Reconfigurable RTL Components

Reconfigurable computing is a cost-effective alternative to technology shrinking in order to achieve higher performance in digital design, especially considering run time reconfiguration. Research in the field consists of new reconfigurable architectures, either coarse-grain or fine-grain, and new methodologies to map applications onto them. Usually, top-down methodologies are proposed, that st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006